A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin
نویسندگان
چکیده
This paper refutes the validity of the polynomial-time algorithm for solving satisfiability proposed by Sergey Gubin. Gubin introduces the algorithm using 3-SAT and eventually expands it to accept a broad range of forms of the Boolean satisfiability problem. Because 3-SAT is NP-complete, the algorithm would have implied P = NP, had it been correct. Additionally, this paper refutes the correctness of his polynomial-time reduction of SAT to 2-SAT.
منابع مشابه
Reducing SAT to 2-SAT
Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.
متن کاملA Polynomial Time Algorithm for SAT
Description of the compatibility matrices method for solution of systems of Boolean equations. The method is applied to determine whether SAT instances have clauses in their disjunctive normal form.
متن کاملA Polynomial Time Algorithm for 3-SAT
The algorithm checks the propositional formulas for patterns of non-satisfiability.
متن کاملPolynomial time algorithm for 3-SAT. Examples of use
The algorithm checks the propositional formulas for patterns of unsatis ability.
متن کامل. C C ] 2 8 A pr 2 00 8 A POLYNOMIAL TIME ALGORITHM FOR 3 - SAT
Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0804.2699 شماره
صفحات -
تاریخ انتشار 2008